polynomial multiplication
英 [ˌpɒli'nəʊmiəl ˌmʌltɪplɪˈkeɪʃn]
美 [ˌpɑli'noʊmiəl ˌmʌltɪplɪˈkeɪʃn]
网络 多项式乘法
双语例句
- Further requirements: to achieve quadratic polynomial multiplication.
进一步要求：实现三元二次多项式的乘法。 - The finite field multiplication requires two steps: polynomial multiplication and reduction modulo the irreducible f ( x).
有限域乘法由多项式乘法和模不可约多项式f（x）两步实现。 - The FPT Algorithm of Multi-variable Polynomial Multiplication
多元多项式乘积的FPT算法 - In order to improve their speed, "fast polynomial multiplication algorithm" and "fast algorithm of r-circulant matrix inversion" are proposed, which offer obviously computational advantages.
本文提出了快速多项式乘法运算算法和r-循环矩阵快速乘逆运算算法，用以提高这两种运算的速度，具有明显的速度优势。 - In this paper, we discussed a two-variable cyclic convolution algorithm based on two-variable polynomial multiplication, and compared it with the fast polynomial transform ( FPT) algorithm. As a result, this kind of algorithm is efficient in computation of two-variable cyclic convolutions.
本文详细讨论一种基于多元多项式乘积的二维循环卷积算法，并与其快速多项式变换（FPT）算法进行了比较，比较结果显示该算法具有明显的优越性。 - Fast Polynomial Multiplication and Toeplitz Matrix
多项式的快速乘法与Toeplitz矩阵 - Through the finite domain multiplier design based on the polynomial multiplication theory in finite domain, a new simple multiplication algorithm in finite domain is introduced.
采用基于有限域中多项式乘法理论的快速有限域乘法器的设计，得到了简单的有限域上乘积运算算法。 - A fast method for polynomial multiplication with FFT is provided. The relationship between polynomial multiplication and toeplitz matrix is discussed.
提供了一种用快速富里叶变换实现多项式相乘的方法，讨论了多项式乘法与Toeplitz矩阵之间的关系。 - In previous works, Montgomery method has been extensively studied in modular integer multiplication and polynomial basis multiplication over GF ( 2m), but never for normal basis multiplication. The proposed multiplier is the first work in this aspect.
Montgomery方法在整数模乘运算和GF（2m）上多项式基乘法都有重要的应用，但对于正规基乘法尚未有相关工作，本章工作填补了该方面的空白。 - In method one, the basis state of the codes are transformed into the multiplication of an information polynomial by the generator polynomial. Then networks can be realized with operations of polynomial multiplication.
方法一将码字基态变换为信息多项式与生成多项式的乘积，然后用量子态上的多项式乘法操作实现编译码网络。 - Because of the complexity of the correction function in the Log-MAP algorithm, a method based on polynomial approximation is proposed to approximate the correction function, in which the logarithmic and exponential algorithms are replaced by addition and multiplication.
由于Log-MAP算法中校正函数项的存在使得算法复杂度较高，本文提出采用基于逼近多项式的方法对校正函数进行近似，将其中的对数与指数运算用加法和乘法运算代替。 - The part of article firstly builds the equivalent relationships between sparse array and polynomial, polynomial multiplication and spatial convolution of transmiting array and receiving array, thus polynomial theories can be utilized for radar array design.
文章首先提出了将稀疏阵列与多项式一一对应的思想，然后把多项式乘积与收发阵列空间卷积关系进行等效，再利用多项式的一些理论设计阵列。 - By using the Dickson polynomial basis, finite field multiplication is converted to special Toeplitz matrix-vector multiplication, which can be computed by block segmentation and recursive computation approach.
在Dickson多项式基表示下，有限域乘法转化为特殊的Toeplitz矩阵-向量乘法，Toeplitz矩阵-向量乘法可以利用分块递归计算法计算。